Step of Proof: nil_fseg
11,40
postcript
pdf
Inference at
*
I
of proof for Lemma
nil
fseg
:
T
:Type,
l
:(
T
List). fseg(
T
;[];
l
)
latex
by ((((Unfold `fseg` 0)
CollapseTHEN (Auto'))
)
CollapseTHEN (((InstConcl [
l
])
Co
CollapseTHEN (Auto
))
))
latex
C
1
:
C1:
1.
T
: Type
C1:
2.
l
:
T
List
C1:
l
= (
l
@ [])
C
.
Definitions
fseg(
T
;
L1
;
L2
)
,
x
:
A
.
B
(
x
)
,
x
:
A
B
(
x
)
,
Type
,
,
as
@
bs
,
x
:
A
.
B
(
x
)
,
x
:
A
B
(
x
)
,
s
=
t
,
t
T
,
[]
,
type
List
Lemmas
append
wf
origin